A Compositional Semantics for Statecharts using Labeled Transition Systems
نویسندگان
چکیده
We characterize the statecharts step semantics of Pnueli and Shalev as a mapping from an inductively deened algebra of statecharts terms to a domain of labeled transition systems (LTSs). Statecharts equivalence = sc , i.e. LTS iso-morphism, is shown not to be a congruence and hence the step semantics is not compositional. We deene a new semantic mapping > to a domain of LTSs with a richer label structure, and show that LTS isomorphism in this domain is the largest congruence contained in = sc .
منابع مشابه
A Process Language for Statecharts ? Francesca
We deene a compositional labelled transition system semantics for statecharts via a translation into a new process language called SP. The main novelty of the language is an operator of process reene-ment, which reeects the statecharts hierarchical structure. The translation agrees with Pnueli and Shalev semantics of statecharts. However, since the language is parametric in the set of basic act...
متن کاملEquivalences of Statecharts
We present a new semantics of Statecharts that excludes failures and a compositional formulation of this semantics based on Labelled Transition Systems (LTS). We consider a hierarchy of LTS equivalences and we study their congruence properties w.r. to statechart operators. 1 I n t r o d u c t i o n Statecharts are a specification language for reactive systems, introduced originally in [4]. The ...
متن کاملConformance Testing for Statecharts
We describe an approach to automatically generate test cases from object-oriented statecharts as they are used in the UML and supported by development tools such as I-Logics Rhapsody. Applying Tretmans’ approach to generate test cases for I/O automata from labeled transition systems, we consider a statechart as a specification of a system under test. Test cases generated from such a specificati...
متن کاملVeriication of Temporal and Real-time Properties of Statecharts
This thesis is concerned with the formal veri cation of statecharts. Statecharts area synchronous formalism for the speci cation of reactive systems that is obtainedby introducing in classical state-transition diagrams notions of hierarchy, parallelismand communication. Propositional -calculus is a very convenient formalism for ex-pressing the properties characterizing the c...
متن کاملA Process Language for Statecharts
We deene a compositional labelled transition system semantics for statecharts via a translation into a new process language called SP. The main novelty of the language is an operator of process reene-ment, which reeects the statecharts hierarchical structure. The translation agrees with Pnueli and Shalev semantics of statecharts. However, since the language is parametric in the set of basic act...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994